Rational ignoring with unbounded cognitive capacity
نویسندگان
چکیده
In a canonical decision problem with standard assumptions, we demonstrate that payoffs and probabilities may interact in such a way that expected-payoffmaximizing decisions do not depend on payoff-relevant information. This result holds without decision costs, cognitive constraints, or other forms of bounded rationality. Instances in which information-frugal decision rules achieve high levels of performance arise solely as a consequence of the stochastic payoff distribution and its covariation with predictive signals in the environment. Formalized as independence of expectedpayoff-maximizing decision rules from payoff-relevant predictors, the phenomenon of rational ignoring is shown to require inversely related payoffs and probabilities.
منابع مشابه
Psychometric Properties of Rational-Experiential Inventory, and It's Relationship with Cognitive Regulation of Emotions
Psychologists have proposed two styles for thinking and processing information. Experiential system, which is automatic and non-verbal; And the Rational system, which is analytical and verbal. The aim of the present study was to evaluate the psychometric properties of the Rational- Experiential Inventory; and to find it's relationship with cognitive regulation of emotions. This cross-sectional ...
متن کاملNetwork capacity of cognitive radio relay network
After successful dynamic spectrum access, cognitive radio (CR) must be able to relay the message/packets to the destination node by utilizing existing primary system(s) (PS) and/or cooperative/cognitive radio nodes in the cognitive radio network. In this paper, we pioneer the exploration of the fundamental behaviors of interference between CRs and PS in such a relay network via network coding. ...
متن کاملCognitive Distance, Absorptive Capacity and Group Rationality: A Simulation Study
We report the results of a simulation study in which we explore the joint effect of group absorptive capacity (as the average individual rationality of the group members) and cognitive distance (as the distance between the most rational group member and the rest of the group) on the emergence of collective rationality in groups. We start from empirical results reported in the literature on grou...
متن کاملRational Secret Sharing & Game Theory
Consider m out of n secret sharing protocol among n players where each player is rational. In 2004, J.Halpern and V.Teague first pointed out problem for any Rational Secret Sharing protocol from completely game theoretic point of view and then proposed a randomized protocol to solve that problem. Later in 2006, S. Dov Gordon and J. Katz extended the idea proposed by J.Halpern and V.Teague and i...
متن کاملComputational complexity of solving polynomial differential equations over unbounded domains with non-rational coefficients
In this note, we extend the result of [PG16] about the complexity of solving polynomial differential equations over unbounded domains to work with non-rational input. In order to deal with arbitrary input, we phrase the result in framework of Conputable Analysis [Ko91]. As a side result, we also get a uniform result about complexity of the operator, and not just about the solution. The complexi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007